A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization

This study devotes to incorporating a nonmonotone strategy with an automatically adjusted trust-region radius to propose a more efficient hybrid of trust-region approaches for unconstrained optimization. The primary objective of the paper is to introduce a more relaxed trust-region approach based on a novel extension in trust-region ratio and radius. The next aim is to employ stronger nonmonotone strategies, i.e. bigger trust-region ratios, far from the optimizer and weaker nonmonotone strategies, i.e. smaller trust-region ratios, close to the optimizer. The global convergence to first-order stationary points as well as the local superlinear and quadratic convergence rates are also proved under some reasonable conditions. Some preliminary numerical results and comparisons are also reported.     

On the numerical radius of Lipschitz operators in Banach spaces

We study the numerical radius of Lipschitz operators on Banach spaces via the Lipschitz numerical index, which is an analogue of the numerical index in Banach space theory. We give a characterization of the numerical radius and obtain a necessary and sufficient condition for Banach spaces to have Lipschitz numerical index 1. As an application, we show that real lush spaces and C  -rich subspaces have Lipschitz numerical index 1. Moreover, using the Gâteaux differentiability of Lipschitz operators, we characterize the Lipschitz numerical index of separable Banach spaces with the RNP. Finally, we prove that the Lipschitz numerical index has the stability properties for the _c0$c_0$-, _l1$l_1$-, and _l∞$l_{\infty }$-sums of spaces and vector-valued function spaces. From this, we show that the C(K)$C(K)$ spaces, _L1(μ)$L_1(\mu )$-spaces and _L∞(ν)$L_{\infty }(\nu )$-spaces have Lipschitz numerical index 1.     

Traveling wave solutions in a diffusive system with two preys and one predator

This paper is concerned with the traveling wave solutions in a diffusive system with two preys and one predator. By constructing upper and lower solutions, the existence of nontrivial traveling wave solutions is established. The asymptotic behavior of traveling wave solutions is also confirmed by combining the asymptotic spreading with the contracting rectangles. Applying the theory of asymptotic spreading, the nonexistence of traveling wave solutions is proved.     

Threshold analysis of the susceptible-infected-susceptible model on overlay networks

In this paper, we study epidemic spreading on overlay networks in which n multiple sets of links interconnect among the same nodes. By using the microscopic Markov-chain approximation (MMA) approach, we establish the conditions of epidemic outbreak for two kinds of spreading mechanisms in such an overlay network: the concatenation case and the switching case. When a uniform infection rate is set in all the subnetworks, we find the epidemic threshold for the switching case is just n times as large as that of concatenation case. We also find that the overlay network with a uniform infection rate can be considered as an equivalent (in the sense of epidemic dynamics and epidemic threshold) weighted network. To be specific, the concatenation case corresponds to the integer weighted network, while the switching case corresponds to the fractional weighted network. Interestingly, the time-varying unweighted network can be mapped into the static weighted network. Our analytic results exhibit good agreement with numerical simulations.     

一致超图谱半径界的改进结果

利用张量理论研究一致超图的谱半径.首先,利用对角相似张量与原张量同谱的性质,结合张量特征值的圆盘定理,给出谱半径的上界,这一上界严格小于最大度;其次,通过超图的度向量给出谱半径的下界.改进了超图谱半径上下界的原有结果.     

New eigenvalue inclusion sets for tensors

Two new eigenvalue inclusion sets for tensors are established. It is proved that the new eigenvalue inclusion sets are tighter than that in Qi's paper “Eigenvalues of a real supersymmetric tensor”. As applications, upper bounds for the spectral radius of a nonnegative tensor are obtained, and it is proved that these upper bounds are sharper than that in Yang's paper “Further results for Perron–Frobenius theorem for nonnegative tensors”. And some sufficient conditions of the positive definiteness for an even‐order real supersymmetric tensor are given. Copyright © 2012 John Wiley & Sons, Ltd.     

The distance coloring of graphs

Let G be a connected graph with maximum degree Δ≥ 3.We investigate the upper bound for the chromatic number χγ(G) of the power graph Gγ.It was proved that χγ(G) ≤Δ(Δ-1)γ-1Δ-2+ 1 =:M + 1,where the equality holds if and only if G is a Moore graph.If G is not a Moore graph,and G satisfies one of the following conditions:(1) G is non-regular,(2) the girth g(G) ≤ 2γ- 1,(3)g(G) ≥ 2γ + 2,and the connectivity κ(G) ≥ 3 if γ≥ 3,κ(G) ≥ 4 but g(G) 6 if γ = 2,(4) Δis sufficiently larger than a given number only depending on γ,then χγ(G) ≤ M- 1.By means of the spectral radius λ1(G) of the adjacency matrix of G,it was shown that χ2(G) ≤λ1(G)2+ 1,where the equality holds if and only if G is a star or a Moore graph with diameter 2 and girth 5,and χγ(G)λ1(G)γ+1 ifγ≥3.     

给定围长的三圈图的无符号拉普拉斯谱半径

A tricyclic graph G =（V（G）, E（G）） is a connected and simple graph such that｜E（G）｜ = ｜V（G）｜＋2. Let Tg nbe the set of all tricyclic graphs on n vertices with girth g. In this paper, we will show that there exists the unique graph which has the largest signless Laplacian spectral radius among all tricyclic graphs with girth g containing exactly three（resp., four）cycles. And at the same time, we also give an upper bound of the signless Laplacian spectral radius and the extremal graph having the largest signless Laplacian spectral radius in Tg n,where g is even.